Non-Hermitian Polynomial Hybrid Monte Carlo
نویسنده
چکیده
In this thesis algorithmic improvements and variants for two-flavor lattice QCD simulations with dynamical fermions are studied using the O(a) improved Dirac-Wilson operator in the Schrödinger functional setup and employing a hybrid Monte Carlo-type (HMC) update. Both, the Hermitian and the Non-Hermitian operator are considered. For the Hermitian Dirac-Wilson operator we investigate the advantages of symmetric over asymmetric even-odd preconditioning, how to gain from multiple time scale integration as well as how the smallest eigenvalues affect the stability of the HMC algorithm. In case of the non-Hermitian operator we first derive (semi-)analytical bounds on the spectrum before demonstrating a method to obtain information on the spectral boundary by estimating complex eigenvalues with the Lanzcos algorithm. These spectral boundaries allow to visualize the advantage of symmetric even-odd preconditioning or the effect of the Sheikholeslami-Wohlert term on the spectrum of the non-Hermitian Dirac-Wilson operator. Taking advantage of the information of the spectral boundary we design best-suited, complex, scaled and translated Chebyshev polynomials to approximate the inverse Dirac-Wilson operator. Based on these polynomials we derive a new HMC variant, named nonHermitian polynomial Hybrid Monte Carlo (NPHMC), which allows to deviate from importance sampling by compensation with a reweighting factor. Furthermore an extension employing the Hasenbusch-trick is derived. First performance figures showing the dependence on the input parameters as well as a comparison to our standard HMC are given. Comparing both algorithms with one pseudo-fermion, we find the new NPHMC to be slightly superior, whereas a clear statement for the two pseudo-fermion variants is yet not possible.
منابع مشابه
Spectral properties of the non-hermitian Wilson-Dirac operator in the Schrödinger functional
We report on some preparatory investigations for the simulation of the QCD Schrödinger functional with a non-hermitian polynomial hybrid Monte Carlo algorithm. The complex spectrum of the non-hermitean free operator with SF boundary condititons is computed semianalytically. Then it is shown how one can obtain relevant information on the boundary of the spectral domain also in the presence of no...
متن کاملM ar 1 99 6 Exact Local Bosonic Algorithm for Full QCD
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. It is based on a non-hermitian polynomial approximation of the inverse of the quark matrix and a global Metropolis accept/reject correction of the systematic errors. We show that this algorithm is a real alternative to the Hybrid Monte Carlo algorithm.
متن کاملOne-Flavour Hybrid Monte Carlo with Wilson Fermions
The Wilson fermion determinant can be written as product of the determinants of two hermitian positive definite matrices. This formulation allows to simulate non-degenerate quark flavors by means of the hybrid Monte Carlo algorithm. A major numerical difficulty is the occurrence of nested inversions. We construct a Uzawa iteration scheme which treats the nested system within one iterative process.
متن کاملThe PZ method for estimating determinant ratios, with applications
We introduce a new method for estimating determinants or determinant ratios of large matrices, which combines the techniques of Padè approximation with rational functions and Z2 noise estimation of traces of large matrices. The method requires simultaneously solving several matrix equations, which can be conveniently accomplished using the MR method. We include some preliinary results, and indi...
متن کاملar X iv : h ep - l at / 0 20 90 61 v 1 4 S ep 2 00 2 1 An exact Polynomial Hybrid Monte Carlo
We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dy-namical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix. The systematic error from the polynomial approximation is removed by the Kennedy-Kuti noisy Metropolis test so that the algorithm becomes exact at a finite ...
متن کامل